Approximate centerpoints with proofs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast approximate probabilistically checkable proofs

We investigate the question of when a verifier, with the aid of a proof, can reliably compute a function faster than it can without the proof. The proof system model that we use is based on a variant of the Probabilistically Checkable Proofs (PCP) model, in which a verifier can ascertain the correctness of the proof by looking at very few locations in the proof. However, known results in the PC...

متن کامل

Centerpoints and Tverberg's technique

Using a technique that Tverberg and Vrecica [TV93] discovered to give a surprisingly simple proof of Tverberg’s theorem, we show the following extension of the centerpoint theorem: given any set P of n points in the plane, and a parameter 1/3 ≤ c ≤ 1, one can always find a disk D such that any closed half-space containing D contains at least cn points of P , and furthermore, D contains at most ...

متن کامل

On Strong Centerpoints

Let P be a set of n points in R and F be a family of geometric objects. We call a point x ∈ P a strong centerpoint of P w.r.t F if x is contained in all F ∈ F that contains more than cn points from P , where c is a fixed constant. A strong centerpoint does not exist even when F is the family of halfspaces in the plane. We prove the existence of strong centerpoints with exact constants for conve...

متن کامل

k-Centerpoints Conjectures for Pointsets in ℝd

In this paper, we introduce the notion of k-centerpoints for any set P of n points in Rd. These unify and generalize previous results such as the classical centerpoint theorem 1, and the recently-proven ray-shooting theorem 2. We define two variants: affine k-centerpoints, and topological k-centerpoints. We prove their equivalence in R2, and conjecture that these are in fact equivalent in any d...

متن کامل

Hulls And Centerpoints In Positive Definite Space ∗

In this paper, we present algorithms for computing approximate hulls and centerpoints for collections of matrices in positive definite space. There are many applications where the data under consideration, rather than being points in a Euclidean space, are positive definite (p.d.) matrices. These applications include diffusion tensor imaging in the brain, elasticity analysis in mechanical engin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computational Geometry

سال: 2010

ISSN: 0925-7721

DOI: 10.1016/j.comgeo.2010.04.006